Y Z X Parallel Complexity of Numerically Accurate Linear
نویسندگان
چکیده
This work merges preliminary results presented at ESA `96 and SPAA `97. Dipartimento di Informatica, Universit a di Pisa, Corso Italia 40, 56125 Pisa, Italy, and IMC-CNR. via S. Maria 46, 56126 Pisa, Italy. Email: [email protected]. Supported by Murst 40% funds. Dipartimento di Scienze e Tecnologie Avanzate, Universit a di Torino, Via Cavour 84, 15100 Alessandria, Italy. Email: [email protected]. Dipartimento Scienze dell'Informazione, Universit a di Bologna, Piazza Porta S. Donato 5, 40127 Bologna, Italy. Email: [email protected]. Matrix factorization algorithms form the backbone of state-of-the-art numerical libraries and packages, such as LAPACK and MATLAB [2, 14]. Indeed, factoring a matrix is almost always the rst step of many scienti c computations, and usually the one which places the heaviest demand in terms of computing resources. In view of their importance, some authors have investigated the parallel complexity of the most popular matrix factor-
منابع مشابه
A matrix method for estimating linear regression coefficients based on fuzzy numbers
In this paper, a new method for estimating the linear regression coefficients approximation is presented based on Z-numbers. In this model, observations are real numbers, regression coefficients and dependent variables (y) have values for Z-numbers. To estimate the coefficients of this model, we first convert the linear regression model based on Z-numbers into two fuzzy linear regression mode...
متن کاملAn Efficient Numerical Algorithm For Solving Linear Differential Equations of Arbitrary Order And Coefficients
Referring to one of the recent works of the authors, presented in~cite{differentialbpf}, for numerical solution of linear differential equations, an alternative scheme is proposed in this article to considerably improve the accuracy and efficiency. For this purpose, triangular functions as a set of orthogonal functions are used. By using a special representation of the vector forms of triangula...
متن کاملIsomorphisms in unital $C^*$-algebras
It is shown that every almost linear bijection $h : Arightarrow B$ of a unital $C^*$-algebra $A$ onto a unital$C^*$-algebra $B$ is a $C^*$-algebra isomorphism when $h(3^n u y) = h(3^n u) h(y)$ for allunitaries $u in A$, all $y in A$, and all $nin mathbb Z$, andthat almost linear continuous bijection $h : A rightarrow B$ of aunital $C^*$-algebra $A$ of real rank zero onto a unital$C^*$-algebra...
متن کاملCharacterization of Lie higher Derivations on $C^{*}$-algebras
Let $mathcal{A}$ be a $C^*$-algebra and $Z(mathcal{A})$ the center of $mathcal{A}$. A sequence ${L_{n}}_{n=0}^{infty}$ of linear mappings on $mathcal{A}$ with $L_{0}=I$, where $I$ is the identity mapping on $mathcal{A}$, is called a Lie higher derivation if $L_{n}[x,y]=sum_{i+j=n} [L_{i}x,L_{j}y]$ for all $x,y in mathcal{A}$ and all $ngeqslant0$. We show that ${L_{n}}_{n...
متن کاملConnections between C(X) and C(Y), where Y is a subspace of X
In this paper, we introduce a method by which we can find a close connection between the set of prime $z$-ideals of $C(X)$ and the same of $C(Y)$, for some special subset $Y$ of $X$. For instance, if $Y=Coz(f)$ for some $fin C(X)$, then there exists a one-to-one correspondence between the set of prime $z$-ideals of $C(Y)$ and the set of prime $z$-ideals of $C(X)$ not containing $f$. Moreover, c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997